翻訳と辞書 Words near each other ・ Suzuki TU250 ・ Suzuki Twin ・ Suzuki V-Strom 1000 ・ Suzuki V-Strom 650 ・ Suzuki VL 1500 Intruder LC / Boulevard C90 ・ Suzuki VX 800 ・ Suzuki Wagon R ・ Suzuki World Rally Team ・ Suzuki X-90 ・ Suzuki X-HEAD ・ Suzuki XL-7 ・ Suzuki XL7 ・ Suzuki XN85 ・ Suzuki's RM 250 Motocross ・ Suzuki-gun ・ Suzuki-Kasami algorithm ・ Suzukia ・ Suzukichō Station ・ Suzuko ・ Suzuko Mimori ・ Suzuko no Koi ・ Suzumeda Station ・ Suzumenomiya Station ・ Suzumushi ・ Suzuna ・ Suzunami ・ Suzunone Seven! ・ Suzunsky District ・ Suzuran ・ Suzuran Yamauchi Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Suzuki-Kasami algorithm ： ウィキペディア英語版 Suzuki-Kasami algorithm The Suzuki-Kasami algorithm〔Ichiro Suzuki, Tadao Kasami, ''A distributed mutual exclusion algorithm'', ACM Transactions on Computer Systems, Volume 3 Issue 4, Nov. 1985 (pages 344 - 349)〕 is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only process able to enter its critical section. This is a modification to Ricart–Agrawala algorithm〔Ricart, Glenn, and Ashok K. Agrawala. "An optimal algorithm for mutual exclusion in computer networks." Communications of the ACM 24.1 (1981): 9-17.〕 in which a REQUEST and REPLY message are used for attaining the critical section. but in this algorithm they introduced a method in which a seniority vise and also by handing over the critical section to other node by sending a single PRIVILEGE message to other node. So, the node which has the privilege it can use the critical section and if it does not have one it cannot. If a process wants to enter its critical section and it does not have the token, it broadcasts a request message to all other processes in the system. The process that has the token, if it is not currently in a critical section, will then send the token to the requesting process. The algorithm makes use of increasing Request Numbers to allow messages to arrive out-of-order. == Algorithm description == Let $n$ be the number of processes. Each process is identified by an integer in $1,\; ...,\; n$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Suzuki-Kasami algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.